ISRO CSE 2017
Q41.
Match with the suitable one:\begin{array}{|l|l|l|l|} \hline & \text { List-1 } & & \text { List-2 } \\ \hline \text { (a) } & \text { Multicast group membership } & \text { i. } & \text { Distance Vector routing } \\ \hline \text { (b) } & \text { Interior gateway protocol } & ii . & \text { IGMP } \\ \hline \text { (c) } & \text { Exterior gateway protocol } & iii . & \text { OSPF } \\ \hline \text { (d) } & \text { RIP } & iv . & \text { BGP } \\ \hline \end{array}Q45.
Which of the following data structure is useful in traversing a given graph by breadth first search?Q46.
The recurrence relation that arises in relation with the complexity of binary search is:Q47.
If L and P are two recursively enumerable languages then they are not closed underQ48.
Given the following statementsS1 : Every context-sensitive language L is recursiveS2 : There exists a recursive language that is not context-sensitiveWhich statements are true?Q50.
The time complexity of computing the transitive closure of a binary relation on a set of n elements is known to be